Approximating geodesic tree distance
نویسندگان
چکیده
Billera, Holmes, and Vogtmann introduced an intriguing new phylogenetic tree metric for weighted trees with useful properties related to statistical analysis. However, the best known algorithm for calculating this distance is exponential in the number of leaves of the trees compared. We point out that lower and upper bounds for this distance, which can be calculated in linear time, can differ by at most a multiplicative factor of √ 2. © 2007 Published by Elsevier B.V.
منابع مشابه
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
We present simple methods for approximating the diameters, radii, and centers of finite sets in δ-hyperbolic geodesic spaces and graphs. We also provide a simple construction of distance approximating trees of δ-hyperbolic graphs G on n vertices with an additive error O(δ log2 n) comparable with that given by M. Gromov.
متن کاملDistance Approximating Trees: Complexity and Algorithms
Let Δ ≥ 1 and δ ≥ 0 be real numbers. A tree T = (V,E′) is a distance (Δ, δ)–approximating tree of a graph G = (V,E) if dH(u, v) ≤ Δ dG(u, v) + δ and dG(u, v) ≤ Δ dH(u, v) + δ hold for every u, v ∈ V . The distance (Δ, δ)-approximating tree problem asks for a given graph G to decide whether G has a distance (Δ, δ)-approximating tree. In this paper, we consider unweighted graphs and show that the...
متن کاملAn Airway Tree-shape Model for Geodesic Airway Branch Labeling
We present a mathematical airway tree-shape framework where airway trees are compared using geodesic distances. The framework consists of a rigorously defined shape space for treelike shapes, endowed with a metric such that the shape space is a geodesic metric space. This means that the distance between two tree-shapes can be realized as the length of the geodesic, or shortest deformation, conn...
متن کاملComputing Geodesic Distances in Tree Space
We present two algorithms for computing the geodesic distance between phylogenetic trees in tree space, as introduced by Billera, Holmes, and Vogtmann (2001). We show that the possible combinatorial types of shortest paths between two trees can be compactly represented by a partially ordered set. We calculate the shortest distance along each candidate path by converting the problem into one of ...
متن کاملA combinatorial method for connecting BHV spaces representing different numbers of taxa
The phylogenetic tree space introduced by Billera, Holmes, and Vogtmann (BHV tree space) is a CAT(0) continuous space that represents trees with edge weights with an intrinsic geodesic distance measure. The geodesic distance measure unique to BHV tree space is well known to be computable in polynomial time, which makes it a potentially powerful tool for optimization problems in phylogenetics an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 103 شماره
صفحات -
تاریخ انتشار 2007